Amenability of horocyclic products of percolation trees
نویسنده
چکیده
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Følner sequence (which we call strong amenability).
منابع مشابه
Stochastic Homogenization of Horospheric Tree Products
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The existence of such an invariant measure allows us to establish amenability of horospheric products of random trees.
متن کاملStructure of Certain Banach Algebra Products
Let and be Banach algebras, , and . We define an -product on which is a strongly splitting extension of by . We show that these products form a large class of Banach algebras which contains all module extensions and triangular Banach algebras. Then we consider spectrum, Arens regularity, amenability and weak amenability of these products.
متن کاملGroup-invariant Percolation on Graphs
Let G be a closed group of automorphisms of a graph X. We relate geometric properties of G and X, such as amenability and unimodularity, to properties of G-invariant percolation processes on X, such as the number of infinite components, the expected degree, and the topology of the components. Our fundamental tool is a new masstransport technique that has been occasionally used elsewhere and is ...
متن کاملAmenability of horospheric products of uniformly growing trees
The horospheric product of two uniformly growing trees is amenable if and only if their growth rates match.
متن کاملLamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions
The lamplighter group over Z is the wreath product Zq ≀ Z. With respect to a natural generating set, its Cayley graph is the Diestel-Leader graph DL(q, q). We study harmonic functions for the “simple” Laplacian on this graph, and more generally, for a class of random walks on DL(q, r), where q, r ≥ 2. The DL-graphs are horocyclic products of two trees, and we give a full description of all posi...
متن کامل